11![Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo](https://www.pdfsearch.io/img/146bd2dffe0a7ffb0bfc05d416c69f02.jpg) | Add to Reading ListSource URL: qip2011.quantumlah.orgLanguage: English - Date: 2011-01-11 05:14:56
|
---|
12![Monoidal Theories and Graph Rewriting in Quantum Computing Aleks Kissinger Lucas Dixon Monoidal Theories and Graph Rewriting in Quantum Computing Aleks Kissinger Lucas Dixon](https://www.pdfsearch.io/img/7ed3c6cc6fa0a9fc07ea3e8d7ad9fed7.jpg) | Add to Reading ListSource URL: dream.inf.ed.ac.ukLanguage: English - Date: 2009-11-09 13:01:36
|
---|
13![Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari† Department of Combinatorics & Optimization Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari† Department of Combinatorics & Optimization](https://www.pdfsearch.io/img/f6aab3f23d6af74b89bdf65e5839f79b.jpg) | Add to Reading ListSource URL: qip2011.quantumlah.orgLanguage: English - Date: 2011-01-11 05:19:49
|
---|
14![New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1 New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1](https://www.pdfsearch.io/img/17695babcbb2f5c691f3047e9d6a52ba.jpg) | Add to Reading ListSource URL: drops.dagstuhl.deLanguage: English - Date: 2012-12-10 08:58:52
|
---|
15![Sketching Earth-Mover Distance on Graph Metrics? Andrew McGregor and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcgregor,dstubbs}@cs.umass.edu Sketching Earth-Mover Distance on Graph Metrics? Andrew McGregor and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcgregor,dstubbs}@cs.umass.edu](https://www.pdfsearch.io/img/89ba8f207f678ee477c2565e4d9aa80e.jpg) | Add to Reading ListSource URL: people.cs.umass.eduLanguage: English - Date: 2013-06-17 11:57:08
|
---|
16![MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗ MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗](https://www.pdfsearch.io/img/749d043a8d0af8b0321c9f3016b6bcdb.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2008-02-01 00:39:23
|
---|
17![Dense Graphs, Node Sets, and Riders: Toward a Foundation for Particle Physics without Continuum Mathematics Dense Graphs, Node Sets, and Riders: Toward a Foundation for Particle Physics without Continuum Mathematics](https://www.pdfsearch.io/img/a5e0bc128534f182d3c8fc9c335e061e.jpg) | Add to Reading ListSource URL: www.complex-systems.comLanguage: English - Date: 2012-06-20 13:21:03
|
---|
18![Microsoft Word - Document1 Microsoft Word - Document1](https://www.pdfsearch.io/img/61c21a388b1ea7ed62e9b7c636e49431.jpg) | Add to Reading ListSource URL: www.cmsim.orgLanguage: English - Date: 2015-05-19 15:49:12
|
---|
19![Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com](https://www.pdfsearch.io/img/cd98126ba2c23486ccd8451dffbcdab1.jpg) | Add to Reading ListSource URL: www.usna.eduLanguage: English - Date: 2015-05-19 21:11:47
|
---|
20![114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential 114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential](https://www.pdfsearch.io/img/6134f2f7240815608968ccbe3ff1fd33.jpg) | Add to Reading ListSource URL: dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:48
|
---|